A Gallager-Tanner construction based on convolutional codes
نویسندگان
چکیده
Generalized low density codes are built by applying a Tanner-like construction to binary recursive systematic convolutional codes. The Gallager-Tanner construction is restricted to 2 levels only. We describe the structure of a GLD code and show how to compute its ensemble performance. We also prove that RSC based GLD codes are asymptotically good. A parity-check interpretation of turbo codes is given for both parallel and serial concatenations.
منابع مشابه
VLSI Design of a Fully-Parallel High-Throughput Decoder for Turbo Gallager Codes
The most powerful channel coding schemes, namely those based on turbo codes and low-density parity-check (LDPC) Gallager codes, have in common the principle of iterative decoding. However, the relative coding structures and decoding algorithms are substantially different. This paper presents a 2048-bit, rate-1/2 soft decision decoder for a new class of codes known as Turbo Gallager Codes. These...
متن کاملA Construction for Low Density Parity Check Convolutional Codes Based on Quasi-Cyclic Block Codes
A set of convolutional codes with low density parity check matrices is derived from a class of quasi-cyclic low density parity check block codes. Their performance when decoded using the belief propagation algorithm is investigated.
متن کاملConstruction of low-density parity-check codes from Kirkman triple systems
Gallager introduced LDPC codes in 1962, presenting a construction method to randomly allocate bits in a sparse parity-check matrix subject to constraints on the row and column weights. Since then improvements have been made to Gallager’s construction method and some analytic constructions for LDPC codes have recently been presented. However, analytically constructed LDPC codes comprise only a v...
متن کاملGallager codes for CDMA applications. II. Implementations, complexity, and system capacity
We focus our attention on Gallager codes with parameters compatible with the IS-95 cellular radio standard. We discuss low complexity software and hardware implementations of an iterative decoder for fN; ; 3g Gallager codes. We estimate that by using Gallager codes, a factor of five improvement in the code-division multiple-access system capacity relative to an uncoded system can be achieved, e...
متن کاملGallager Codes for CDMA Applications—Part II: Implementations, Complexity, and System Capacity
We focus our attention on Gallager codes with parameters compatible with the IS-95 cellular radio standard. We discuss low complexity software and hardware implementations of an iterative decoder for fN; ; 3g Gallager codes. We estimate that by using Gallager codes, a factor of five improvement in the code-division multiple-access system capacity relative to an uncoded system can be achieved, e...
متن کامل